Algebraic Feedback Shift Registers Based on Function Fields
نویسنده
چکیده
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations of linear feedback shift registers. We describe conditions under which such AFSRs produce sequences with various ideal randomness properties. We also show that there is an efficient algorithm which, given a prefix of a sequence, synthesizes a minimal such AFSR that outputs the sequence.
منابع مشابه
Polynomial pseudo-noise sequences based on algebraic feedback shift registers
We apply the framework of algebraic feedback shift registers to polynomial rings over finite fields. This gives a construction of new pseudorandom sequences (over non-prime finite fields), which satisfy Golomb’s three randomness criteria.
متن کاملRegister Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based on the algebra of π-adic numbers, where π is an element in a ring R, and produce sequences of elements in R/(π). We give several cases where the register synthesis problem can be solved by an efficient algorithm. Conseq...
متن کاملA. Synthesis and Linearization of Nonlinear Feedback Shift Registers -basis of a Model of Memoryt Linear Shift Registers Have Been Extensively Studied since the Pioneering Work Of
Linear shift registers have been extensively studied since the pioneering work of D. A. Huffman. A general theory was created by Huffman, l Golomb, Elspas, Stern, Friedland, Zierler, Hartmannis, Massey, and others. This progress was mainly due to the identification of the operations performed by linear switching circuits with algebraic operations over Galois fields. There was no general theory ...
متن کاملCombining Certain Nonlinear Feedback Shift Registers
Stream ciphers that deploy linear feedback shift registers (LFSRs) have been shown to be vulnerable under fast correlation attacks [20], [21], [14], algebraic attacks [7], [28], fast algebraic attacks [6], [1], and fault attacks [13]. We discuss certain nonlinear feedback shift registers (NLFSRs) recommended as substitutes for LFSRs in stream cipher systems.
متن کاملLarge Period Nearly deBruijn FCSR Sequences ( Extended
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...
متن کامل